Spartan: Sparse Robust Addressable Networks

A Peer-to-Peer (P2P) network is a dynamic collection of nodes that connect with each other via virtual overlay links built upon an underlying (usually, the Internet). P2P networks are highly and can experience very heavy churn, i.e., large number join/leave continuously. Thus, building maintaining stable important problem has been studied extensively for two decades. In this paper, we present our called Sparse Robust Addressable Network (Spartan). Spartan be quickly efficiently in fully distributed fashion within O(logn) rounds. Furthermore, structure maintained, again, manner despite adversarially controlled churn (i.e., joining leaving) significant variation nodes. Moreover, new join committee O(1) rounds leaving leave without any notice. The lies [n,fn] fixed f≥1. Up to ϵn (for some small but ϵ>0) added/deleted period P P∈O(loglogn). Despite such uncertainty network, maintains Θ(n∕logn) committees addressable collections Θ(logn) polynomial(n) high probability. Spartan’s also capable performing sustained computation passing messages between other. protocol designed static simulated on minimal overhead. This makes ideal platform developing applications. We experimentally show will remain robust as long committee, average, contains 24 size up 10240.